graph partition meaning in Chinese
图的划分
Examples
- A problem on the computational complexity of graph partitions
关于图划分中的一个计算复杂性问题 - For more on improving sparse matrix algorithms , read fast and effective algorithms for graph partitioning and sparse - matrix ordering
如果您想了解更多关于提高稀疏矩阵算法的信息，请阅读 - With the help of metis , which is a software package in static graph partitioning , we construct a type of block jacobi preconditioner
J时十u个1任用问题，分别用该分解作近似川j i ’ d寸十八’ 。 - Experiments show that the new optimized partition algorithm can improve the parallel simulation performance compared with the ones partitioned by traditional graph partition algorithms
实验表明,该优化划分方法相对于传统的图划分算法能够有效地提高模拟性能。 - We have studied how to distill a connection matrix between two nodes in a generalized switched network ; using tarjan ’ s graph partition algorithm and nonseparable two - terminal graph concept , we proposed an effective algorithm
对从广义开关网络中提取出两点间连接矩阵的方法进行了研究,利用tarjan的拓扑图块划分算法、开关网络中的不可分二端图概念等设计了较有效的算法。